1073D - Berland Fair - CodeForces Solution

#include <iostream>
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define loopp(i,a,b) for(int i=a;i<b;i++)
#define loopn(i,a,b) for(int i=a;i>=0;i--)
#define pb push_back
using namespace std;



void solve(){
    int n;
    long long t;
    cin>>n>>t;
    vector<int> a(n);
    int minel=1e9;
    loopp(i,0,n) cin>>a[i], minel=min(minel,a[i]);
    
    long long ans=0;
    while(t>=minel){
        long long add=0;
        long long sum=0;
        for(int i=0;i<n;i++){
            if(a[i]<=t){
                sum+=1ll*a[i];
                t-=1ll*a[i];
                add++;
            }
        }
        ans+=add+(t/sum)*add;
        t%=sum;
    }
    cout<<ans<<endl;
    
    
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	cout.tie(NULL);
	solve();
	
	return 0;
}